Streamlining progress-based derivations of concurrent programs

Bilateral Proofs of Safety and Progress Properties of Concurrent Programs

This paper suggests a [email protected] of composable specification of concurrent programs that permits: (1) verification of program code for a given specification, and (2) composition of the specifications of the components to yield the specification of a program. The specification consists of both terminal properties that hold at the end of a program execution (if the execution terminate...

Optimising Obsidian Programs Through Derivations

Event-based Composition of Concurrent Programs

This paper presents a model for concurrent programming, where programs (concurrent program structures) are represented as composition expressions over component programs with suitably de ned operators. In this model of programming, called Composition bY Event Speci cation (C-YES), a composition of programs speci es that all events (individual occurrences of named operations, called actions) of ...

Cross-Entropy-Based Replay of Concurrent Programs

Replay is an important technique in program analysis, allowing to reproduce bugs, to track changes, and to repeat executions for better understanding of the results. Unfortunately, since re-executing a concurrent program does not necessarily produce the same ordering of events, replay of such programs becomes a dif cult task. The most common approach to replay of concurrent programs is based on...

Type-based complexity analysis for concurrent programs

We introduce a type system for concurrent programs described as a parallel imperative language using while-loops and fork/wait instructions, in which processes do not share a global memory, in order to analyze computational complexity. The type system provides an analysis of the data-flow based both on a data ramification principle related to tiering discipline and on secure typed languages. Th...